A VLSI Pipeline Design of a Fast Prime Factor DFT on a Finite Field
نویسندگان
چکیده
_.a conventional prime factor discrete Fourier transform (DFT) algorithm is used to realize a discrete Fourier-like transform on the finite fieM, GF(qg ). A pipeline structure is used to implement this prime factor DFT over GF(qn). This algorithm is developed to compute cyclic convolutions of complex numbers and to decode ReedSolomon codes. Such a pipeline fast prime factor DFT algorithm over GF(qg _) is regular, simple, expandable, and naturally suitable for VLSI implementation. An e_ample illustrating the pipeline aspect of a 30-point transform over GF(q n) is presented.
منابع مشابه
A New Fast Discrete Fourier Transform
This paper presents a new fast Discrete Fourier Transform (DFT) algorithm. By rewriting the DFT, a new algorithm is obtained that uses 2 n?2 (3n?13)+4n?2 real multiplications and 2 n?2 (7n? 29) + 6n + 2 real additions for a real data N = 2 n point DFT, comparable to the number of operations in the Split-Radix method, but with slightly fewer multiply and add operations in total. Because of the o...
متن کاملA Novel Vlsi Architecture of High Speed 1d Discrete Wavelet Transform
This paper describes an efficient implementation for a multi-level convolution based 1-D DWT hardware architecture for use in FPGAs. The proposed architecture combines some hardware optimization techniques to develop a novel DWT architecture that has high performance and is suitable for portable and high speed devices. The first step towards the hardware implementation of the DWT algorithm was ...
متن کاملA New Approach to Pipeline FFT Processor
A new VLSI architecture for real-time pipeline FFT processor is proposed. A hardware oriented radix-22 algorithm is derived by integrating a twiddle factor decomposition technique in the divide and conquer approach. Radix-22 algorithm has the same multiplicative complexity as radix-4 algorithm, but retains the butterfly structure of radix-2 algorithm. The single-path delay-feedback architecture...
متن کاملStructure of finite wavelet frames over prime fields
This article presents a systematic study for structure of finite wavelet frames over prime fields. Let $p$ be a positive prime integer and $mathbb{W}_p$ be the finite wavelet group over the prime field $mathbb{Z}_p$. We study theoretical frame aspects of finite wavelet systems generated by subgroups of the finite wavelet group $mathbb{W}_p$.
متن کاملON COMPOSITION FACTORS OF A GROUP WITH THE SAME PRIME GRAPH AS Ln(5)
The prime graph of a finite group $G$ is denoted by$ga(G)$. A nonabelian simple group $G$ is called quasirecognizable by primegraph, if for every finite group $H$, where $ga(H)=ga(G)$, thereexists a nonabelian composition factor of $H$ which is isomorphic to$G$. Until now, it is proved that some finite linear simple groups arequasirecognizable by prime graph, for instance, the linear groups $L_...
متن کامل